A time-predefined approach to course timetabling
نویسندگان
چکیده
منابع مشابه
A Time-predefined Approach to Course Timetabling
A common weakness of local search metaheuristics, such as Simulated Annealing, in solving combinatorial optimisation problems, is the necessity of setting a certain number of parameters. This tends to make significantly increase the total amount of time required to solve the problem and often requires a high level of experience from the user. This paper is motivated by the goal of overcoming th...
متن کاملA time-predefined local search approach to exam timetabling problems
In recent years the computational power of computers has increased dramatically. This in turn has allowed search algorithms to execute more iterations in a given amount of real time. Does this necessarily always lead to an improvement in the quality of final solutions? This paper is devoted to the investigation of that question. We present two variants of local search algorithms where the searc...
متن کاملA Hybrid Approach for University Course Timetabling
The university course timetabling problem deals with the assignment of lectures to specific timeslots and rooms. The goal is to satisfy the soft constraints to the largest degree possible while constructing a feasible schedule. In this paper, we present a hybrid approach consisting of three phases. During phase 1, initial solutions are generated using a constructive heuristic. An improvement ap...
متن کاملA hybrid metaheuristic approach to the university course timetabling problem
This paper describes the development of a novel metaheuristic that combines an electromagnetic-like mechanism (EM) and the great deluge algorithm (GD) for the University course timetabling problem. This well-known timetabling problem assigns lectures to specific numbers of timeslots and rooms maximizing the overall quality of the timetable while taking various constraints into account. EM is a ...
متن کاملA Heuristic Incremental Modeling Approach to Course Timetabling
The general timetabling problem is an assignment of activ ities to xed time intervals adhering to a prede ned set of resource availabilities Timetabling problems are di cult to solve and can be ex tremely time consuming without some computer assistance In this paper the application of constraint based reasoning to timetable generation is examined Speci cally we consider how a timetabling proble...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: YUJOR
سال: 2003
ISSN: 0354-0243,1820-743X
DOI: 10.2298/yjor0302139b